An objective penalty function method for nonlinear programming
نویسندگان
چکیده
منابع مشابه
An objective penalty function method for nonlinear programming
K e y w o r d s N o n l i n e a r programming, Exact penalty function, Objective penalty function. 1. I N T R O D U C T I O N The problem we consider in this paper is as follows: f0(x), s.t. k ( a ) < 0, i E I = { 1 , 2 , . . . , m } , (P) The authors would like to thank anonymous referees' comments and remarks that help us to improve the presentation of this paper considerably. This research w...
متن کاملAn Evolutionary Algorithm for Zero-one Nonlinear Optimization Problems Based on an Objective Penalty Function Method
In many evolutionary algorithms, as fitness functions, penalty functions play an important role. In order to solve zero-one nonlinear optimization problems, a new objective penalty function is defined in this paper and some of its properties for solving integer nonlinear optimization problems are given. Based on the objective penalty function, an algorithm with global convergence for integer no...
متن کاملAn interior-point piecewise linear penalty method for nonlinear programming
We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an `2-penalty function. The PLPF is defined by a set of penalty parameters that correspond to break points of the PLPF and are updated at every iteration. The `2-penalty function, like traditional penalty functions for NLP, is defined b...
متن کاملA Penalty Function Algorithm with Objective Parameters and Constraint Penalty Parameter for Multi-Objective Programming
In this paper, we present an algorithm to solve the inequality constrained multi-objective programming (MP) by using a penalty function with objective parameters and constraint penalty parameter. First, the penalty function with objective parameters and constraint penalty parameter for MP and the corresponding unconstraint penalty optimization problem (UPOP) is defined. Under some conditions, a...
متن کاملAn interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming
In this paper, we consider an interior point method for nonlinear semidefinite programming. Yamashita, Yabe and Harada presented a primal-dual interior point method in which a nondifferentiable merit function was used. By using shifted barrier KKT conditions, we propose a differentiable primal-dual merit function within the framework of the line search strategy, and prove the global convergence...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics Letters
سال: 2004
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(04)90105-x